Generalised cheater detection and identification
نویسنده
چکیده
Cheater detection and identification are important issues in the process of secret reconstruction. To detect and identify cheaters most of the algorithms need the dealer to generate and distribute additional information to shareholders. Recently, algorithms have been proposed to detect and identify cheaters. If more than t (i.e. the threshold) shares, for example j (i.e. t < j) shares in the secret reconstruction, then redundancy of shares can be used to detect and identify cheaters. The detectability and identifiability of cheaters are proportional to the number of redundant shares. However, the number of redundant shares, j− t is fixed if original shares are used in the secret reconstruction. So, a threshold changeable verifiable secret sharing (TCVSS) has been developed, which allows shareholders working together to change the threshold t into a new threshold t′ (i.e. t′ < j) and generate new shares; whereas at the same time, maintain the original secret. The verifiability of the proposed TCVSS enables shareholders to verify that their new shares have been properly generated. The number of redundant shares can be changed to j− t′ if new shares are used in the secret reconstruction. Discussion on how to determine the new threshold t′ in order to detect and identify cheaters successfully has also been included.
منابع مشابه
Design of Reliable and Secure Devices Realizing Shamir's Secret Sharing
Shamir’s secret sharing scheme is an effective way to distribute secret to a group of shareholders. The security of the unprotected sharing scheme, however, can be easily broken by cheaters or attackers who maliciously feed incorrect shares during the secret recovery stage or inject faults into hardware computing the secret. In this paper, we propose cheater detection and identification schemes...
متن کاملCheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes
In this paper we analyze the cheating detection and cheater identification problems for the secret sharing schemes based on the Chinese remainder theorem (CRT ), more exactly for Mignotte [1] and Asmuth-Bloom [2] schemes. We prove that the majority of the solutions for Shamir’s scheme [3] can be translated to these schemes and, moreover, there are some interesting specific solutions.
متن کاملCheater Detection in SPDZ Multiparty Computation
In this work we revisit the SPDZ multiparty computation protocol by Damg̊ard et al. for securely computing a function in the presence of an unbounded number of dishonest parties. The SPDZ protocol is distinguished by its fast performance. A downside of the SPDZ protocol is that one single dishonest party can enforce the computation to fail, meaning that the honest parties have to abort the compu...
متن کاملUniversal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority
For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rus...
متن کاملGiving it all away: altruism and answers to the Wason selection task
The Wason selection task, a standard test of conditional reasoning, has featured prominently in experimental studies of cognitive adaptations for cooperation. The most prominent of these is Cosmides' investigations of cheater detection on social contract versions of the Wason selection task [Cognition 31 (1989) 187–276]. Subsequent to Cosmides' initial investigations, several researchers [Evol ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IET Information Security
دوره 8 شماره
صفحات -
تاریخ انتشار 2014